Routing in self-organizing nano-scale irregular networks
نویسندگان
چکیده
منابع مشابه
Self-organizing topology aggregation, QoS prediction and routing in large scale overlay networks
This paper introduces a scalable approach for efficient routing and low-cost multi-level Quality of Service (QoS) estimates between any two nodes in large overlay networks. We extend a distributed implementation of the Basic Partition algorithm [7], and aggregate the topology of the underlying network hierarchically. We evaluate the proposed approach through simulation and show that it performs...
متن کاملMultihop Routing In Self-Organizing Wireless Sensor Networks
Wireless sensor networks have emerged in the past decade as a result of recent advances in microelectronic system fabrication, wireless communications, integrated circuit technologies, microprocessor hardware and nano-technology, progress in adhoc networking routing protocols, distributed signal processing, pervasive computing and embedded systems. As routing protocols are application specific,...
متن کاملSome Requirements for Autonomic Routing in Self-organizing Networks
This paper addresses some requirements of self-organizing networks as well as interoperability problems due to merges and splits phenomena. In a mobile environment, merges and splits characterize the spatial overlap between two self-organized networks. While merge refers to the time when two disjoint networks meet and overlap, split refers to the time of partition. In a dynamic environment, Aut...
متن کاملusing game theory techniques in self-organizing maps training
شبکه خود سازمانده پرکاربردترین شبکه عصبی برای انجام خوشه بندی و کوانتیزه نمودن برداری است. از زمان معرفی این شبکه تاکنون، از این روش در مسائل مختلف در حوزه های گوناگون استفاده و توسعه ها و بهبودهای متعددی برای آن ارائه شده است. شبکه خودسازمانده از تعدادی سلول برای تخمین تابع توزیع الگوهای ورودی در فضای چندبعدی استفاده می کند. احتمال وجود سلول مرده مشکلی اساسی در الگوریتم شبکه خودسازمانده به حسا...
A Self-organizing Routing Scheme for Random Networks
Most routing protocols employ address aggregation to achieve scalability with respect to routing table size. But often, as networks grow in size and complexity, address aggregation fails. Other networks, e.g. sensor-actuator networks or ad-hoc networks, that are characterized by organic growth might not at all follow the classical hierarchical structures that are required for aggregation. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Journal on Emerging Technologies in Computing Systems
سال: 2010
ISSN: 1550-4832,1550-4840
DOI: 10.1145/1721650.1721653